A Note on the Road-Coloring Conjecture
نویسندگان
چکیده
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a graph is a road-coloring, are noted. Probabilistic analysis is then used to show that, if the outdegree of every edge in an n-vertex digraph is δ = ω(logn), a road-coloring for the graph exists. An equivalent re-statement of the conjecture is then given in terms of the cross-product of two graphs.
منابع مشابه
-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملA Note on Synchronized Automata and Road Coloring Problem
We consider a problem of labeling a directed multigraph so that it becomes a synchronized finite automaton, as an ultimate goal to solve the famous Road Coloring Conjecture, cf. [1,2].We introduce a relabeling method which can be used for a large class of automata to improve their “degree of synchronization”. This allows, for example, to formulate the conjecture in several equivalent ways.
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملThe Road Coloring Problem
The road coloring problem is an interesing problem proposed over 40 years ago by Adler, Goodwyn and Weiss. Hundreds of mathematicians worked on this problem and failed to make the conjecture a theorem. Finally, in 2007, it was proved by a 60-year-old Israeli mathematician, Avraham Trahtman. It turns out the prove was quite simple after Trahtman partitioned the graph into cycles and trees. The d...
متن کاملA Min-Max theorem about the Road Coloring Conjecture
The Road Coloring Conjecture is an old and classical conjecture posed in Adler and Weiss (1970); Adler et al. (1977). Let G be a strongly connected digraph with uniform out-degree 2. The Road Coloring Conjecture states that, under a natural (necessary) condition that G is “aperiodic”, the edges of G can be colored red and blue such that “universal driving directions” can be given for each verte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 49 شماره
صفحات -
تاریخ انتشار 1998